Situation Calculus Game Structures and GDL

نویسندگان

  • Giuseppe De Giacomo
  • Yves Lespérance
  • Adrian R. Pearce
چکیده

We present a situation calculus-based account of multiplayers synchronous games in the style of general game playing. Such games can be represented as action theories of a special form, situation calculus synchronous game structures (SCSGSs), in which we have a single action tick whose effects depend on the combination of moves selected by the players. Then one can express properties of the game, e.g., winning conditions, playability, weak and strong winnability, etc. in a first-order alternating-time μ-calculus. We discuss verification in this framework considering computational effectiveness. We also show that SCSGSs can be considered as a firstorder variant of the Game Description Language (GDL) that supports infinite domains and possibly non-terminating games. We do so by giving a translation of GDL specifications into SCSGSs and showing its correctness. Finally, we show how a player’s possible moves can be specified in a Golog-like programming language.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Synchronous Games in the Situation Calculus

We develop a situation calculus-based account of multi-player synchronous games. These are represented as action theories called situation calculus synchronous game structures (SCSGSs) that involve a single action tick whose effects depend on the combination of moves chosen by the players. Properties of games, e.g., winning conditions, playability, weak and strong winnability, etc. can be expre...

متن کامل

Reasoning About General Games Described in GDL-II

Recently the general Game Description Language (GDL) has been extended so as to cover arbitrary games with incomplete/imperfect information. Learning—without human intervention—to play such games poses a reasoning challenge for general game-playing systems that is much more intricate than in case of complete information games. Action formalisms like the Situation Calculus have been developed fo...

متن کامل

Representing and Reasoning About the Rules of General Games With Imperfect Information

A general game player is a system that can play previously unknown games just by being given their rules. For this purpose, the Game Description Language (GDL) has been developed as a high-level knowledge representation formalism to communicate game rules to players. In this paper, we address a fundamental limitation of state-of-the-art methods and systems for General Game Playing, namely, thei...

متن کامل

Logical-Epistemic Foundations of General Game Descriptions

A general game player automatically learns to play arbitrary new games solely by being told their rules. For this purpose games are specified in the general Game Description Language (GDL), a variant of Datalog with function symbols that uses a few game-specific keywords. A recent extension of basic GDL allows the description of nondeterministic games with any number of players who may have inc...

متن کامل

The Epistemic Logic Behind the Game Description Language

A general game player automatically learns to play arbitrary new games solely by being told their rules. For this purpose games are specified in the game description language GDL, a variant of Datalog with function symbols and a few known keywords. In its latest version GDL allows to describe nondeterministic games with any number of players who may have imperfect, asymmetric information. We an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016